Type Inferencing for Polymorphic Order-Sorted Logic Programs
نویسنده
چکیده
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if one does not employ the full power of the used type systems. We present a complete type inferencing algorithm that covers the polymorphic order-sorted types in PROTOS-L, a logic programming language that allows for polymorphism as in ML and for hierarchically structured monomorphic types.
منابع مشابه
Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types
In this paper we present the semantics of a functional logic language with parametric and order-sorted polymorphism. Typed programs consist of a polymorphic signature and a set of constructor-based conditional rewriting rules for which we deene a semantic calculus. The denotational semantics of the language is based on Scott domains interpreting constructors and functions by monotonic and conti...
متن کاملAn E cient Constraint Language for Polymorphic Order-sorted Resolution
In recent years various sorted logics have been developed, mostly to facilitate knowledge representation and to speed up automated deduction. We present a polymorphic order-sorted logic that can be implemented e ciently. Because the polymorphism is almost unrestricted, it is possible for two terms to have an exponential number of maximally general uni ers. To guarantee a single most general uni...
متن کاملTyped Hybrid Description Logic Programs with Order-Sorted Semantic Web Type Systems based on OWL and RDFS
In the recent years rule-based programming in terms of declarative logic programming has formed the basis for many Artificial Intelligence (AI) applications and is well integrated in the mainstream information technology capturing higher-level decision logics. Typically, the standard rule systems and rule-based logic programming languages such as Prolog derivatives are based on the untyped theo...
متن کاملA Typed Hybrid Description Logic Programming Language with Polymorphic Order-Sorted DL-Typed Unification for Semantic Web Type Systems
In the recent years rule-based programming in terms of declarative logic programming has formed the basis for many Artificial Intelligence (AI) applications and is well integrated in the mainstream information technology capturing higher-level decision logics. Typically, the standard rule systems and rule-based logic programming languages such as Prolog derivatives are based on the untyped theo...
متن کاملHorn Clause Programs with Polymorphic Types: Semantics and Resolution
This paper presents a Horn clanse logic where functions and predicates are declared with polymorphic types. Types are parameterized with type variables. This leads to an ML-like polymorphic type system. A type declaration of a function or predicate restricts the possible use of this function or predicate so that only certain terms are allowed to be arguments for this function or predicate. The ...
متن کامل